Computable Banach Spaces via
نویسنده
چکیده
This paper extends the order-theoretic approach to computable analysis via continuous domains to complete metric spaces and Banach spaces. We employ the domain of formal balls to deene a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of closed balls, ordered by reversed inclusion. We characterise computable linear operators as those which map computable sequences to computable sequences and are eeectively bounded. We show that the domain-theoretic computability theory is equivalent to the well-established approach by Pour-El and Richards.
منابع مشابه
Computable functional analysis: compact operators on computable banach spaces and computable best approximation
The present thesis deals with computable functional analysis and in this context, especially, with compact operators on computable Banach spaces. For this purpose, the representation based approach to computable analysis (TTE) is used. In the first part, computable Banach spaces with computable Schauder bases are introduced and two representations each are defined for the dual space of a comput...
متن کاملComputable Banach Spaces via Domain Theory 1
This paper extends the domain-theoretic approach to computable analysis to complete metric spaces and Banach spaces. We employ the domain of formal balls to deene a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of closed balls, ordered by reversed inclusion. We characterise computable linear operators as those which map computable seque...
متن کاملBanach Spaces as Data Types
We introduce the operators modified limit and accumulation on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable metric space to a computable Banach space is internally computable. We motivate the need for internal concepts of computability by observing that the complexity of th...
متن کاملComputability of Banach Space Principles
We investigate the computable content of certain theorems which are sometimes called the “principles” of the theory of Banach spaces. Among these the main theorems are the Open Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also study closely related theorems, as Banach’s Inverse Mapping Theorem, the Theorem on Condensation of Singularities and the BanachStein...
متن کاملComputational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed, convex and bounded subset of a computable real Hilbert space are precisely the nonempty, co-r.e. weakly closed, convex subsets of the domain. A unif...
متن کامل